A Systematic Presentation of Quantified Modal Logics
نویسندگان
چکیده
this paper is an attempt at providing a systematic presentation of Quantified Modal Logics (with constant domains and rigid designators). We present a set of modular, uniform, normalizing, sound and complete labelled sequent calculi for all QMLs whose frame properties can be expressed as a finite set of first-order sentences with equality. We first present CQK, a calculus for the logic QK, and then we extend it to any such logic QL. Each calculus, called CQL, is modular (obtained by adding rules to CQK), uniform (each added rule is clearly related to a property of the frame), normalizing (frame reasoning only happens at the top of the proof tree) and Kripke-sound and complete for QL. We improve on the existing literature on the subject (mainly, [21]) by extending the class of logics for which such a presentation is given, and by giving a new proof of soundness and completeness.
منابع مشابه
TPTP and Beyond: Representation of Quantified Non-Classical Logics
The practical employment of automated deduction systems requires the user to input problem statements in a well-formed string representation. While this presentation is usually fixed by the respective system, the various language dialects of the TPTP library are meanwhile accepted as a de-facto standard for all current automated theorem provers based on classical logics. In the context of reaso...
متن کاملConstant Domain QuantifiedModal Logics Without Boolean Negation
: This paper provides a sound and complete axiomatisation for constant domain modal logics without Boolean negation. This is a simpler case of the difficult problem of providing a sound and complete axiomatisation for constant-domain quantified relevant logics, which can be seen as a kind of modal logic with a twoplace modal operator, the relevant conditional. The completeness proof is ...
متن کاملA Systematic Proof Theory for Several Modal Logics
The family of normal propositional modal logic systems are given a highly systematic organisation by their model theory. This model theory is generally given using Kripkean frame semantics, and it is systematic in the sense that for the most important systems we have a clean, exact correspondence between their constitutive axioms as they are usually given in a Hilbert style and conditions on th...
متن کاملA systematic proof theory for several modal logics ( extended abstract ) ∗
The family of normal propositional modal logic systems is given a very systematic organisation by their model theory. This model theory is generally given using frame semantics, and it is systematic in the sense that for the most important systems we have a clean, exact correspondence between their constitutive axioms as they are usually given in a HilbertLewis style and conditions on the acces...
متن کاملBisimulation Quantified Logics: Undecidability
In this paper we introduce a general semantic interpretation for propositional quantification in all multi-modal logics based on bisimulations (bisimulation quantification). Bisimulation quantification has previously been considered in the context of isolated modal logics, such as PDL (D’Agostino and Hollenberg, 2000), intuitionistic logic (Pitts, 1992) and logics of knowledge (French 2003). We...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Logic Journal of the IGPL
دوره 10 شماره
صفحات -
تاریخ انتشار 2002